Enumerating the k best plane spanning trees
نویسندگان
چکیده
منابع مشابه
Enumerating k-Way Trees
This paper makes a contribution to the enumeration of trees. We prove a new result about k-way trees, point out some special cases, use it to give a new proof of Cayley’s enumeration formula for labelled trees, and observe that our techniques allow various types of k-way trees to be generated uniformly at random. We recall the definition: a k-way tree is either empty or it consists of a root no...
متن کاملEnumerating Constrained Non-crossing Geometric Spanning Trees
In this paper we present an algorithm for enumerating without repetitions all non-crossing geometric spanning trees on a given set of n points in the plane under edge constraints (i.e., some edges are required to be included in spanning trees). We will first prove that a set of all edge-constrained non-crossing spanning trees is connected via remove-add flips, based on the constrained smallest ...
متن کاملK-best Spanning Tree Parsing
This paper introduces a Maximum Entropy dependency parser based on an efficient kbest Maximum Spanning Tree (MST) algorithm. Although recent work suggests that the edge-factored constraints of the MST algorithm significantly inhibit parsing accuracy, we show that generating the 50-best parses according to an edge-factored model has an oracle performance well above the 1-best performance of the ...
متن کاملEnumerating spanning trees of graphs with an involution
As the extension of the previous work by Ciucu and the present authors (J. Combin. Theory Ser. A 112(2005) 105–116), this paper considers the problem of enumeration of spanning trees of weighted graphs with an involution which allows fixed points. We show that if G is a weighted graph with an involution, then the sum of weights of spanning trees of G can be expressed in terms of the product of ...
متن کاملFinding the k Smallest Spanning Trees
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log β(m,n) + k2); for planar graphs this bound can be improved to O(n+ k2). We also show that the k best spanning trees for a set of points in the plane can be computed in time O(min(k2n + n log n, k2 + kn log(n/k))). The k best orth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2001
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(00)00029-8